Partitioning sets of oriented triples into the smallest nontrivial oriented triple systems
نویسندگان
چکیده
We study partitions of the set of all cyclic (respectively, transitive) triples chosen from a v-set into pairwise disjoint MTS(4)s (respectively, DTS(4)s). We find necessary conditions for the partitions. Furthermore, we prove that the necessary conditions for the partitions are also sufficient.
منابع مشابه
Smallest defining sets of directed triple systems
A directed triple system of order v, DTS(v), is a pair (V,B) where V is a set of v elements and B is a collection of ordered triples of distinct elements of V with the property that every ordered pair of distinct elements of V occurs in exactly one triple as a subsequence. A set of triples in a DTS(v) D is a defining set for D if it occurs in no other DTS(v) on the same set of points. A definin...
متن کاملRDF triples management in roStore RDF triples management in roStore
Résumé : This paper tackles issues encountered in storing and querying services dealing with information described with Semantic Web languages, e.g. OWL and RDF(S). Our work considers RDF triples stored in relational databases. We assume that depending on the applications and queries asked to RDF triple stores, different partitioning approaches can be considered : either storing all triples in ...
متن کاملA new approach for storing RDF triples based on ontology modularization
Managing RDF data in an effective manner is one of significant factors in realizing semantic web vision. Currently, there are two general approaches for storing RDF data which are column-oriented and row-oriented and each one has advantages and disadvantages. These two approaches are used in relational DBMSs. After reviewing different approaches and methods for storing RDF triples, we put forwa...
متن کاملPartition Triples: A Tool for Reduction of Data Sets
Data sets discussed in this paper are presented as tables with rows corresponding to examples (entities, objects) and columns to attributes. A partition triple is defined for such a table as a triple of partitions on the set of examples, the set of attributes, and the set of attribute values, respectively, preserving the structure of a table. The idea of a partition triple is an extension of th...
متن کاملSe p 20 08 Pythagorean Partition - Regularity and Ordered Triple Systems with the Sum Property Joshua Cooper
Is it possible to color the naturals with finitely many colors so that no Pythagorean triple is monochromatic? This question is even open for two colors. A natural strategy is to show that some small nonbipartite triple systems cannot be realized as a family of Pythagorean triples. It suffices to consider partial triple systems (PTS’s), and it is therefore natural to consider the Fano plane, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 41 شماره
صفحات -
تاریخ انتشار 2008